Random Difference Equations with Subexponential Innovations∗
نویسندگان
چکیده
In this paper we consider the random difference equations S =d (X + S)Y and T =d X+TY , where =d denotes equality in distribution, X and Y are two nonnegative random variables, and S and T on the right-hand side are independent of (X,Y ). Under the assumptions that X follows a subexponential distribution with a nonzero lower Karamata index, that Y takes values in [0, 1] and is not degenerate at 0 or 1, and that (X,Y ) fulfills a certain dependence structure via the conditional tail probability of X given Y , we derive some asymptotic formulas for the tail probabilities of the weak solutions S and T to these equations. In doing so we also obtain some by-products which are interesting in their own right.
منابع مشابه
Subexponential Distributions
We survey the properties and uses of the class of subexponential probability distributions, paying particular attention to their use in modelling heavy-tailed data such as occurs in insurance and queueing applications. We give a detailed summary of the core theory and discuss subexponen-tiality in various contexts including extremes, random walks and L evy processes with negative drift, and sum...
متن کاملOn Sums of Conditionally Independent Subexponential Random Variables
The asymptotic tail-behaviour of sums of independent subexponential random variables is well understood, one of the main characteristics being the principle of the single big jump. We study the case of dependent subexponential random variables, for both deterministic and random sums, using a fresh approach, by considering conditional independence structures on the random variables. We seek suff...
متن کاملA Functional-analytical Approach to the Asymptotics of Recursions
We propose a functional-analytical method to investigate the long-term behavior of recursions (difference equations). It is based on a formulation of given (implicit) recursions as abstract operator equations in sequence spaces. Solving them using appropriate tools from nonlinear analysis yields quantitative convergence results and equips us with a method to verify summable or subexponential de...
متن کاملEquations System coming from Weil descent and subexponential attack for algebraic curve cryptosystem
In [2], Faugére et al. shows that the decomposition problem of a point of elliptic curve over binary field F2n reduces to solving low degree equations system over F2 coming from Weil descent. Using this method, the discrete logarithm problem of elliptic curve over F2n reduces to linear constrains, i.e., solving equations system using linear algebra of monomial modulo field equations, and its co...
متن کاملEquations System coming from Weil descent and subexponential attack for algebraic curve cryptosystem (Draft)
In [2], Faugére et al. shows that the decomposition problem of a point of elliptic curve over binary field F2n reduces to solving low degree equations system over F2 coming from Weil descent. Using this method, the discrete logarithm problem of elliptic curve over F2n reduces to linear constrains, i.e., solving equations system using linear algebra of monomial modulo field equations, and its co...
متن کامل